package exercise;

import java.util.Comparator;
import java.util.PriorityQueue;

public class Test {
    public static void main(String[] args) {
        Heap head = new Heap();
        int[] array = {10,20,30,40,25,34,96,33,66,19};
        int[] arr = head.createBigHeap(array);
        head.poll();
        PriorityQueue<Integer> queue = new PriorityQueue<>((o1,  o2)-> {
                return o2 - o1;
            });

    }
}
